منابع مشابه
A Fast Straight Line Extractor for Vision-Guided Robot Navigation
Table 1: average processing times (in seconds). using the internal clock). As expected, the time spent for grouping and segmentation results to be more variable than the time spent for edge detection or acquisition. The former phases strongly depend on the number of local edges that survive the thresholding phase and are therefore image-complexity dependent, while the other depend only on the i...
متن کاملTranstibial amputee joint rotation moments during straight-line walking and a common turning task with and without a torsion adapter.
Amputees lack movement and control mechanisms at the foot and ankle that result in different strategies for locomotion than nonamputees. The torsion adapter is a prosthetic device designed to minimize shear stress at the residual limb by facilitating rotation in the transverse plane. This study determined if the addition of a torsion adapter alters lower-limb joint rotation moments of transtibi...
متن کاملWalking Straight into Circles
Common belief has it that people who get lost in unfamiliar terrain often end up walking in circles. Although uncorroborated by empirical data, this belief has widely permeated popular culture. Here, we tested the ability of humans to walk on a straight course through unfamiliar terrain in two different environments: a large forest area and the Sahara desert. Walking trajectories of several hou...
متن کاملWalking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment
Given a Digital Straight Line (DSL) of known characteristics (a, b, μ), we address the problem of computing the characteristics of any of its subsegments. We propose a new algorithm as a smart walk in the so called Farey Fan. We take profit of the fact that the Farey Fan of order n represents in a certain way all the digital segments of length n. The computation of the characteristics of a DSL ...
متن کاملIndexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/2.7.634